Capacity Theorems for the "Z" Channel

نویسندگان

  • Hon-Fah Chong
  • Mehul Motani
  • Hari Krishna Garg
چکیده

We consider the two-user “Z” channel (ZC), where there are two senders and two receivers. One of the senders transmits information to its intended receiver (without interfering with the unintended receiver), while the other sender transmits information to both receivers. The complete characterization of the discrete memoryless ZC remains unknown to date. For the Gaussian ZC, the capacity has only been established for a crossover link gain of 1. In this work, we study both the discrete memoryless ZC and the Gaussian ZC. We first establish achievable rates for the general discrete memoryless ZC. The coding strategy uses rate-splitting and superposition coding at the sender with information for both receivers. At the receivers, we use joint decoding. We then specialize the rates obtained to two different types of degraded discrete memoryless ZCs and also derive respective outer bounds to their capacity regions. We show that as long as a certain condition is satisfied, the achievable rate region is the capacity region for one type of degraded discrete memoryless ZC. The results are then extended to the two-user Gaussian ZC with different crossover link gains. We determine an outer bound to the capacity region of the Gaussian ZC with strong crossover link gain and establish the capacity region for moderately strong crossover link gain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gaussian Z Channel with Intersymbol Interference

In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...

متن کامل

Superactivation of Quantum Channels is Limited by the Quantum Relative Entropy Function

In this work we prove that the possibility of superactivation of quantum channel capacities is determined by the mathematical properties of the quantum relative entropy function. Before our work this fundamental and purely mathematical connection between the quantum relative entropy function and the superactivation effect was completely unrevealed. We demonstrate the results for the quantum cap...

متن کامل

Converse Coding Theorems for Quantums Source and Noisy Channel

We prove the weak converse coding theorems for the quantum source and channel. Our results give the lower bound for capacity of source and the upper bounds for capacity of channel. We also prove the monotonicity of mutual quantum information in general case.

متن کامل

Gaussian Interference Channels: An Information Theoretic Point of View

The purpose of this monograph is to introduce up-to-date capacity theorems for the two-user Gaussian interference channel, including both single-antenna and multiple-antenna cases. The monograph starts with the single antenna case and introduces the Han and Kobayashi achievable rate region and its various subregions. Several capacity outer bounds are then presented; these outer bounds, together...

متن کامل

Capacity theorems for the relay channel

A relay channel consists of an input x,, a relay output yl, a cJmnnel output y, and a relay sender x2 (whose trasmission is allowed to depend on the past symbols y,). l%e dependence of the received symbols upm the inpnts is given by p(y,y,lx,,x,). ‘l%e channel is assumed to be memoryless. In this paper the following capacity theorems are proved. 1) Ifyisadegnukdformofy,,the.n C-m=Phx2) min(l(X,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2007